The Marriage of Dynamic Programming and Integer Programming
نویسنده
چکیده
Dynamic programming (DP) has long been used to solve optimisation problems. Though sometimes suffering from the curse of dimensionality, DP has a dowry of integrality. Integer programming (IP) often suffers interminable branch and bound, but brings the gift of flexibility. DP tends to be hard to program, but IP allows us to easily write models that are hard to solve. Until recently, DP and IP have only courted in specialised algorithms, usually column generation, where the IP (or a linear program) was a master and the DP was a subproblem. Recently, R. Kipp Martin showed how DP and IP can be married, using his technique of variable redefinition. A dynamic program can often be written as a network linear program (LP). When viewed this way, we can use the underlying DP network structure to reformulate difficult IPs into new models that have better bounds and solve more quickly. The marriage of DP and IP allows the strengths of both types of algorithms to be combined. There are applications wherever DPs are used, allowing the DP modeler to solve more interesting problems than with DP alone. Though I'll leave out many technical details, this paper is a practical tutorial in Martin's variable redefinition. I'll discuss lot sizing, cutting stock, scheduling, and vehicle routing.
منابع مشابه
A dynamic bi-objective model for after disaster blood supply chain network design; a robust possibilistic programming approach
Health service management plays a crucial role in human life. Blood related operations are considered as one of the important components of the health services. This paper presents a bi-objective mixed integer linear programming model for dynamic location-allocation of blood facilities that integrates strategic and tactical decisions. Due to the epistemic uncertain nature of ...
متن کاملOPTIMIZATION OF A PRODUCTION LOT SIZING PROBLEM WITH QUANTITY DISCOUNT
Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by many researchers. Considering the quantity discount in purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In this paper, stochastic dyn...
متن کاملFeasibility study of presenting a dynamic stochastic model based on mixed integer second-order conic programming to solve optimal distribution network reconfiguration in the presence of resources and demand-side management
Nowadays, with the use of devices such as fossil distributed generation and renewable energy resources and energy storage systems that are operated at the level of distribution networks, the problem of optimal reconfiguration has faced major challenges, so any change in the power of this resources can have different results in reconfiguration. Similarly, load changes during the day can lead to ...
متن کاملStochastic Short-Term Hydro-Thermal Scheduling Based on Mixed Integer Programming with Volatile Wind Power Generation
This study addresses a stochastic structure for generation companies (GenCoʼs) that participate in hydro-thermal self-scheduling with a wind power plant on short-term scheduling for simultaneous reserve energy and energy market. In stochastic scheduling of HTSS with a wind power plant, in addition to various types of uncertainties such as energy price, spinning /non-spinning reserve prices, unc...
متن کاملA Multi-Objective Fuzzy Approach to Closed-Loop Supply Chain Network Design with Regard to Dynamic Pricing
During the last decade, reverse logistics networks received a considerable attention due to economic importance and environmental regulations and customer awareness. Integration of leading and reverse logistics networks during logistical network design is one of the most important factors in supply chain. In this research, an Integer Linear Programming model is presented to design a multi-layer...
متن کاملAn L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کامل